Local Minimization Algorithms for Dynamic Programming Equations
نویسندگان
چکیده
منابع مشابه
Local minimization algorithms for dynamic programming equations
The numerical realization of the dynamic programming principle for continuous-time optimal control leads to nonlinear Hamilton-Jacobi-Bellman equations which require the minimization of a nonlinear mapping over the set of admissible controls. This minimization is often performed by comparison over a finite number of elements of the control set. In this paper we demonstrate the importance of an ...
متن کاملDynamic Programming Algorithms for Haplotype Blocks Partitioning with TagSNPs Minimization
Recent studies show that the patterns of linkage disequilibrium (LD) observed in human chromosome reveal a block-like structure; the high LD regions are called haplotype blocks. The existence of haplotype block structures has serious implications for association-based methods in mapping of disease genes. A Single Nucleotide Polymorphism or SNP is a DNA sequence variation occurring when a single...
متن کاملNonserial dynamic programming and local decomposition algorithms in discrete programming
One of perspective ways to exploit sparsity in the dependency graph of an optimization problem is nonserial dynamic programming (NSDP) which allows to compute solution in stages, each of them uses results from previous stages. The class of discrete optimization problems with the block-tree matrix of constraints is considered. Nonserial dynamic programming (NSDP) algorithm for the solution of th...
متن کاملSolvability and Algorithms for Functional Equations Originating from Dynamic Programming
The main purpose of this paper is to study the functional equation arising in dynamic programming of multistage decision processes f x opty∈Dopt{p x, y , q x, y f a x, y , r x, y f b x, y , s x, y f c x, y } for all x ∈ S. A few iterative algorithms for solving the functional equation are suggested. The existence, uniqueness and iterative approximations of solutions for the functional equation ...
متن کاملDynamic Programming & Local Computation ∗
It has been known for a long time that solving optimization problems by use of local computation techniques reduces to non-serial dynamic programming. Therefore, the valuation algebra axioms constitute in some way also the mathematical justification of dynamic programming. This paper builds up the corresponding theory from the more general perspective of totally ordered semirings with idempoten...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Scientific Computing
سال: 2016
ISSN: 1064-8275,1095-7197
DOI: 10.1137/15m1010269